A Fast Search algorithm for Mean Pyramids Vector Quantization Using Hadamard Transform

In this paper, a fast search algorithm for mean pyramids vector quantization by using Hadamard transform of the vector is proposed. The algorithm uses mean pyramids of the vectors and codewords after applying Hadamard transform and one elimination criterion based on deviation characteristic values in the Hadamard transform domain to eliminate unlikely codewords. Our algorithm has the same quality of the image as the full search algorithm but with less number of distortion calculation and computing time. Also, it is more efficient than using mean pyramids in spatial domain especially in high dimension situations of the vectors.